Many disjoint edges in topological graphs
نویسنده
چکیده
A simple topological graph is a graph drawn in the plane so that its edges are represented by continuous arcs with the property that any two of them meet at most once. Using a new tool developed in [12] we show that every simple topological graph on n vertices contains Ω(n 1 2 / √ log n) pairwise disjoint edges. This improves the previous lower bound of Ω(n 1 3 ) by Suk [17] and by Fulek and Ruiz-Vargas [12].
منابع مشابه
Disjoint Edges in Topological Graphs
A topological graph G is a graph drawn in the plane so that its edges are represented by Jordan arcs. G is called simple, if any two edges have at most one point in common. It is shown that the maximum number of edges of a simple topological graph with n vertices and no k pairwise disjoint edges is O (
متن کاملDisjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
It is shown that for a constant t ∈ N, every simple topological graph on n vertices has O(n) edges if the graph has no two sets of t edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of the intersection graph of the edges is Kt,t-free). As an application, we settle the tangled-thrackle conjecture formulated by Pach, Radoičić, and Tóth: Every...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملEstimating the number of disjoint edges in simple topological graphs via cylindrical drawings
A topological graph drawn on a cylinder whose base is horizontal is angularly monotone if every vertical line intersects every edge at most once. Let c(n) denote the maximum number c such that every simple angularly monotone drawing of a complete graph on n vertices contains at least c pairwise disjoint edges. We show that for every simple complete topological graph G there exists ∆, 0 < ∆ < n,...
متن کاملDensity Theorems for Intersection Graphs of t-Monotone Curves
A curve γ in the plane is t-monotone if its interior has at most t− 1 vertical tangent points. A family of t-monotone curves F is simple if any two members intersect at most once. It is shown that if F is a simple family of n t-monotone curves with at least ǫn intersecting pairs (disjoint pairs), then there exists two subfamilies F1, F2 ⊂ F of size δn each, such that every curve in F1 intersect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 62 شماره
صفحات -
تاریخ انتشار 2015